158 research outputs found
How proofs are prepared at Camelot
We study a design framework for robust, independently verifiable, and
workload-balanced distributed algorithms working on a common input. An
algorithm based on the framework is essentially a distributed encoding
procedure for a Reed--Solomon code, which enables (a) robustness against
byzantine failures with intrinsic error-correction and identification of failed
nodes, and (b) independent randomized verification to check the entire
computation for correctness, which takes essentially no more resources than
each node individually contributes to the computation. The framework builds on
recent Merlin--Arthur proofs of batch evaluation of Williams~[{\em Electron.\
Colloq.\ Comput.\ Complexity}, Report TR16-002, January 2016] with the
observation that {\em Merlin's magic is not needed} for batch evaluation---mere
Knights can prepare the proof, in parallel, and with intrinsic
error-correction.
The contribution of this paper is to show that in many cases the verifiable
batch evaluation framework admits algorithms that match in total resource
consumption the best known sequential algorithm for solving the problem. As our
main result, we show that the -cliques in an -vertex graph can be counted
{\em and} verified in per-node time and space on
compute nodes, for any constant and
positive integer divisible by , where is the
exponent of matrix multiplication. This matches in total running time the best
known sequential algorithm, due to Ne{\v{s}}et{\v{r}}il and Poljak [{\em
Comment.~Math.~Univ.~Carolin.}~26 (1985) 415--419], and considerably improves
its space usage and parallelizability. Further results include novel algorithms
for counting triangles in sparse graphs, computing the chromatic polynomial of
a graph, and computing the Tutte polynomial of a graph.Comment: 42 p
On infinite-finite duality pairs of directed graphs
The (A,D) duality pairs play crucial role in the theory of general relational
structures and in the Constraint Satisfaction Problem. The case where both
classes are finite is fully characterized. The case when both side are infinite
seems to be very complex. It is also known that no finite-infinite duality pair
is possible if we make the additional restriction that both classes are
antichains. In this paper (which is the first one of a series) we start the
detailed study of the infinite-finite case.
Here we concentrate on directed graphs. We prove some elementary properties
of the infinite-finite duality pairs, including lower and upper bounds on the
size of D, and show that the elements of A must be equivalent to forests if A
is an antichain. Then we construct instructive examples, where the elements of
A are paths or trees. Note that the existence of infinite-finite antichain
dualities was not previously known
Automorphism groups and Ramsey properties of sparse graphs
We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todor\v{c}evi\'c correspondence. We investigate amenable and extremely amenable subgroups of these groups using the space of orientations of the graph and results from structural Ramsey theory. Resolving one of the open questions in the area, we show that Hrushovski's example of an -categorical sparse graph has no -categorical expansion with extremely amenable automorphism group
Gaps and dualities in Heyting categories
summary:We present an algebraic treatment of the correspondence of gaps and dualities in partial ordered classes induced by the morphism structures of certain categories which we call Heyting (such are for instance all cartesian closed categories, but there are other important examples). This allows to extend the results of [14] to a wide range of more general structures. Also, we introduce a notion of combined dualities and discuss the relation of their structure to that of the plain ones
Letter graphs and geometric grid classes of permutations: characterization and recognition
In this paper, we reveal an intriguing relationship between two seemingly
unrelated notions: letter graphs and geometric grid classes of permutations. An
important property common for both of them is well-quasi-orderability,
implying, in a non-constructive way, a polynomial-time recognition of geometric
grid classes of permutations and -letter graphs for a fixed . However,
constructive algorithms are available only for . In this paper, we present
the first constructive polynomial-time algorithm for the recognition of
-letter graphs. It is based on a structural characterization of graphs in
this class.Comment: arXiv admin note: text overlap with arXiv:1108.6319 by other author
Harnessing the Bethe Free Energy
Gibbs measures induced by random factor graphs play a prominent role in computer science, combinatorics and physics. A key problem is to calculate the typical value of the partition function. According to the "replica symmetric cavity method", a heuristic that rests on non-rigorous considerations from statistical mechanics, in many cases this problem can be tackled by way of maximising a functional called the "Bethe free energy". In this paper we prove that the Bethe free energy upper-bounds the partition function in a broad class of models. Additionally, we provide a sufficient condition for this upper bound to be tight
The Queue-Number of Posets of Bounded Width or Height
Heath and Pemmaraju conjectured that the queue-number of a poset is bounded
by its width and if the poset is planar then also by its height. We show that
there are planar posets whose queue-number is larger than their height,
refuting the second conjecture. On the other hand, we show that any poset of
width has queue-number at most , thus confirming the first conjecture in
the first non-trivial case. Moreover, we improve the previously best known
bounds and show that planar posets of width have queue-number at most
while any planar poset with and has queue-number at most its
width.Comment: 14 pages, 10 figures, Appears in the Proceedings of the 26th
International Symposium on Graph Drawing and Network Visualization (GD 2018
Space Saving by Dynamic Algebraization
Dynamic programming is widely used for exact computations based on tree
decompositions of graphs. However, the space complexity is usually exponential
in the treewidth. We study the problem of designing efficient dynamic
programming algorithm based on tree decompositions in polynomial space. We show
how to construct a tree decomposition and extend the algebraic techniques of
Lokshtanov and Nederlof such that the dynamic programming algorithm runs in
time , where is the maximum number of vertices in the union of
bags on the root to leaf paths on a given tree decomposition, which is a
parameter closely related to the tree-depth of a graph. We apply our algorithm
to the problem of counting perfect matchings on grids and show that it
outperforms other polynomial-space solutions. We also apply the algorithm to
other set covering and partitioning problems.Comment: 14 pages, 1 figur
The algebra of adjacency patterns: Rees matrix semigroups with reversion
We establish a surprisingly close relationship between universal Horn classes
of directed graphs and varieties generated by so-called adjacency semigroups
which are Rees matrix semigroups over the trivial group with the unary
operation of reversion. In particular, the lattice of subvarieties of the
variety generated by adjacency semigroups that are regular unary semigroups is
essentially the same as the lattice of universal Horn classes of reflexive
directed graphs. A number of examples follow, including a limit variety of
regular unary semigroups and finite unary semigroups with NP-hard variety
membership problems.Comment: 30 pages, 9 figure
- …